Total Domination in Circulant Graphs
نویسندگان
چکیده
Cayley graph is a graph constructed out of a group Γ and a generating set A ⊆ Γ. When Γ = Zn, the corresponding Cayley graph is called as a circulant graph and denoted by Cir(n, A). In this paper, we attempt to find the total domination number of Cir(n, A) for a particular generating set A of Zn and a minimum total dominating set of Cir(n, A). Further, it is proved that Cir(n, A) is 2-total excellent if and only if n = t|A|+ 1 for some integer t > 0.
منابع مشابه
2-Tuple Total Domination Number in Circulant Graphs
In this paper, a necessary and sufficient condition for the existence of an efficient 2-dominating set in a class of circulant graphs has been obtained and for those circulant graphs, an upper bound for the 2domination number is also obtained. For the circulant graphs Cir(n,A), where A = {1, 2, . . . , x, n − 1, n − 2, . . . , n − x} and x ≤ bn−1 2 c, the perfect 2-tuple total domination number...
متن کاملDomination in Circulant Graphs
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that is not adjacent to a vertex of degree one, the total domination number of G− v is less than the total domination number of G. We call these graphs γt-critical. In this paper, we determine the domination and the total domination number in the Circulant graphs Cn〈1, 3〉, and then study γ-criticality...
متن کاملLocating -Total Domination in Circulant Graphs
A locating-total dominating set (LTDS) S of a graph G is a total dominating set S of G such that for every two vertices u and v in V(G) − S, N(u)∩S ≠ N(v)∩S. The locating-total domination number ( ) l t G is the minimum cardinality of a LTDS of G. A LTDS of cardinality ( ) l t G we call a ( ) l t G -set. In this paper, we determine the locating-total domination number for the special clas...
متن کاملOn the Distance Paired-Domination of Circulant Graphs
Let G = (V, E) be a graph without isolated vertices. A set D ⊆ V is a d-distance paired-dominating set of G if D is a d-distance dominating set of G and the induced subgraph 〈D〉 has a perfect matching. The minimum cardinality of a d-distance paired-dominating set for graph G is the d-distance paired-domination number, denoted by γd p(G). In this paper, we study the ddistance paired-domination n...
متن کامل